Primary Decomposition of Lattice Basis Ideals
نویسندگان
چکیده
منابع مشابه
Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals
It is known that algorithms exist which compute primary decompositions of polynomial ideals (Gianni et al., 1988; Eisenbud et al., 1992; Becker and Weispfenning, 1993; and more recently Shimoyama and Yokoyama, 1996). However, in case the ideal is binomial, binomiality of its primary components is not assured, that is, the above algorithms do not necessarily compute a decomposition into binomial...
متن کاملPrimary decomposition of the Mayr-Meyer ideals
Grete Hermann proved in H] that for any ideal I in an n-dimensional polynomial ring over the eld of rational numbers, if I is generated by polynomials f 1 ; : : : ; f k of degree at most d, then it is possible to write f = P r i f i such that each r i has degree at most deg f + (kd) (2 n). Mayr and Meyer in MM] found (generators) of ideals for which a doubly exponential bound in n is indeed ach...
متن کاملEMBEDDING OF THE LATTICE OF IDEALS OF A RING INTO ITS LATTICE OF FUZZY IDEALS
We show that the lattice of all ideals of a ring $R$ can be embedded in the lattice of all its fuzzyideals in uncountably many ways. For this purpose, we introduce the concept of the generalizedcharacteristic function $chi _{s}^{r} (A)$ of a subset $A$ of a ring $R$ forfixed $r , sin [0,1] $ and show that $A$ is an ideal of $R$ if, and only if, its generalizedcharacteristic function $chi _{s}^{...
متن کاملOn lattice of basic z-ideals
For an f-ring with bounded inversion property, we show that , the set of all basic z-ideals of , partially ordered by inclusion is a bounded distributive lattice. Also, whenever is a semiprimitive ring, , the set of all basic -ideals of , partially ordered by inclusion is a bounded distributive lattice. Next, for an f-ring with bounded inversion property, we prove that is a complemented...
متن کاملGröbner Bases and Primary Decomposition of Polynomial Ideals
We present an algorithm to compute the primary decomposition of any ideal in a polynomial ring over a factorially closed algorithmic principal ideal domain R. This means that the ring R is a constructive PID and that we are given an algorithm to factor polynomials over fields which are finitely generated over R or residue fields of R. We show how basic ideal theoretic operations can be performe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0397